Restart Strategies and Internet Congestion

نویسندگان

  • Sebastian M. Maurer
  • Bernardo A. Huberman
چکیده

We recently presented a methodology for quantitatively reducing the risk and cost of executing electronic transactions in a bursty network environment such as the Internet. In the language of portfolio theory, time to complete a transaction and its variance replace the expected return and risk associated with a security, whereas restart times replace combinations of securities. While such a strategy works well with single users, the question remains as to its usefulness when used by many. By using mean field arguments and agent-based simulations, we determine that a restart strategy remains advantageous even if everybody uses it.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : c ha o - dy n / 99 05 03 6 v 1 21 M ay 1 99 9 Restart Strategies and Internet Congestion

We recently presented a methodology for quantitatively reducing the risk and cost of executing electronic transactions in a bursty network environment such as the Internet. In the language of portfolio theory, time to complete a transaction and its variance replace the expected return and risk associated with a security, whereas restart times replace combinations of securities. While such a str...

متن کامل

Restart strategies and Internet congestion q Sebastian

We recently presented a methodology to quantitatively reduce the average time and variance in the time required to execute electronic transactions in a network environment such as the Internet. In the language of portfolio theory, time to complete a transaction and its variance replace the expected return and risk associated with a security, whereas restart times replace combinations of securit...

متن کامل

Efficiency of repeated network interactions

In this paper we consider a network with interactions by two users. Each of them repeatedly issues download requests on the network. These requests may be unsuccessful due to congestion or non-congestion related errors. A user decides when to cancel a request (that is, what his impatience threshold is) and how long to wait before reissuing his request after cancellation of the previous request ...

متن کامل

Some new restart vectors for explicitly restarted Arnoldi method

The explicitly restarted Arnoldi method (ERAM) can be used to find some eigenvalues of large and sparse matrices. However, it has been shown that even this method may fail to converge. In this paper, we present two new methods to accelerate the convergence of ERAM algorithm. In these methods, we apply two strategies for the updated initial vector in each restart cycles. The implementation of th...

متن کامل

VRED: An improvement over RED algorithm by using queue length growth velocity

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره chao-dyn/9905036  شماره 

صفحات  -

تاریخ انتشار 1999